Permutation groups with cyclic-block property and $MNFC$-groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutation Polytopes of Cyclic Groups

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. In the situation that the generator of the group consists of at most two orbits, we can give a complete combinatorial description of the associated permutation polytope. In the case of three orbits the facet structure is...

متن کامل

The Cyclic Groups with them-DCI Property

For a finite group G and a subset S of G which does not contain the identity of G , let Cay(G , S) denote the Cayley graph of G with respect to S. If , for all subsets S , T of G of size m , Cay(G , S) Х Cay(G , T) implies S ␣ ϭ T for some ␣ ෈ Aut(G) , then G is said to have the m-DCI property. In this paper , a classification is presented of the cyclic groups with the m-DCI property , which is...

متن کامل

On the permutation groups of cyclic codes

We classify the permutation groups of cyclic codes over a finite field. As a special case, we find the permutation groups of non-primitive BCH codes of prime length. In addition, the Sylow p-subgroup of the permutation group is given for many cyclic codes of length p. Several examples are given to illustrate the results.

متن کامل

Property Testing for Cyclic Groups and Beyond

This paper studies the problem of testing if an input (Γ, ◦), where Γ is a finite set of unknown size and ◦ is a binary operation over Γ given as an oracle, is close to a specified class of groups. Friedl et al. [Efficient testing of groups, STOC’05] have constructed an efficient tester using poly(log |Γ|) queries for the class of abelian groups. We focus in this paper on subclasses of abelian ...

متن کامل

POS-groups with some cyclic Sylow subgroups

A finite group G is said to be a POS-group if for each x in G the cardinality of the set {y in G | o(y) = o(x)} is a divisor of the order of G. In this paper we study the structure of POS-groups with some cyclic Sylow subgroups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS

سال: 2017

ISSN: 1300-0098,1303-6149

DOI: 10.3906/mat-1508-66